Mapping and Monitoring Zero-Deforestation Commitments
نویسندگان
چکیده
Abstract A growing number of companies have announced zero-deforestation commitments (ZDCs) to eliminate commodities produced at the expense forests from their supply chains. Translating these aspirational goals into forest conservation requires mapping and monitoring (M&M) systems that are technically adequate therefore credible, salient so they address needs decision makers, legitimate in fair unbiased, scalable over space time. We identify 12 attributes M&M contribute assess how two prominent ZDC programs, Amazon Soy Moratorium High Carbon Stock Approach, integrate systems. These programs prioritize different attributes, highlighting fundamental trade-offs design. Rather than prescribe a one-size-fits-all solution, we provide policymakers practitioners with guidance on design fit specific use case may more effective implementation ZDCs.
منابع مشابه
Simulatable Commitments and Efficient Concurrent Zero-Knowledge
We define and construct simulatable commitments. These are commitment schemes such that there is an efficient interactive proof system to show that a given string c is a legitimate commitment on a given value v, and furthermore, this proof is efficiently simulatable given any proper pair (c, v). Our construction is provably secure based on the Decisional Diffie-Hellman (DDH) assumption. Using s...
متن کاملAn Equivalence Between Zero Knowledge and Commitments
We show that a language in NP has a zero-knowledge protocol if and only if the language has an “instance-dependent” commitment scheme. An instance-dependent commitment schemes for a given language is a commitment scheme that can depend on an instance of the language, and where the hiding and binding properties are required to hold only on the YES and NO instances of the language, respectively. ...
متن کاملEfficient Generic Zero-Knowledge Proofs from Commitments
Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel and efficient Zero-knowledge protocol for circuit satisfiability.
متن کاملZero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
The concept of zero-knowledge (ZK) has become of fundamental importance in cryptography. However, in a setting where entities are modeled by quantum computers, classical arguments for proving ZK fail to hold since, in the quantum setting, the concept of rewinding is not generally applicable. Moreover, known classical techniques that avoid rewinding have various shortcomings in the quantum setti...
متن کاملHybrid commitments and their applications to zero-knowledge proof systems
We introduce the notion of hybrid trapdoor commitment schemes. Intuitively a hybrid trapdoor commitment scheme is a primitive which can be either an unconditionally binding commitment scheme or a trapdoor commitment scheme depending on the distribution of commitment parameters. Moreover, such two possible distributions are computationally indistinguishable. Hybrid trapdoor commitments are relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BioScience
سال: 2021
ISSN: ['2579-308X', '2614-669X']
DOI: https://doi.org/10.1093/biosci/biab082